Language-Based Abstraction Refinement for Hybrid System Verification
نویسندگان
چکیده
The standard counterexample-guided abstraction-refinement (cegar) approach uses finite transition systems as abstractions of concrete systems. We present an approach to represent and refine abstractions of infinite-state systems that uses regular languages instead of finite transition systems. The advantage of using languages over transition systems is that we can store more fine-grained information in the abstraction and thus reduce the number of abstract states. Based on this languagebased approach for cegar, we present new abstraction-refinement algorithms for hybrid system verification. Moreover, we evaluate our approach by verifying various non-linear hybrid systems.
منابع مشابه
Assume-Guarantee Abstraction Refinement Meets Hybrid Systems
Compositional verification techniques in the assumeguarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We inte...
متن کاملRecursive and Backward Reasoning in the Verification of Hybrid Systems
In this paper we introduce two improvements to the method of verification of hybrid systems by constraint propagation based abstraction refinement that we introduced earlier. The first improvement improves the recursive propagation of reachability information over the regions constituting the abstraction, and the second improvement reasons backward from the set of unsafe states, instead of reas...
متن کاملRecursive and Backward Reasoning in the Verification on Hybrid Systems
In this paper we introduce two improvements to the method of verification of hybrid systems by constraint propagation based abstraction refinement that we introduced earlier. The first improvement improves the recursive propagation of reachability information over the regions constituting the abstraction, and the second improvement reasons backward from the set of unsafe states, instead of forw...
متن کاملGuaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems
We present a novel approach to the automatic verification and falsification of LTL requirements of non-linear discrete-time hybrid systems. The verification tool uses an interval-based constraint solver for non-linear robust constraints to compute incrementally refined abstractions. Although the problem is in general undecidable, we prove termination of abstraction refinement based verification...
متن کاملGuaranteed Termination in the Verification of LTL Properties of Non-linear Robust Hybrid Systems
We present a novel approach to the automatic verification of LTL requirements of non-linear discrete-time hybrid systems. The verification tool uses an interval-based constraint solver for non-linear robust constraints to compute incrementally refined abstractions. Although the problem is undecidable, we prove termination of abstraction refinement based verification of such properties for the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007